Multivariate Interpolation Formula over Finite Fields and Its Applications in Coding Theory
نویسندگان
چکیده
A multivariate interpolation formula (MVIF) over finite fields is presented by using the proposed Kronecker delta function. The MVIF can be applied to yield polynomial relations over the base field among homogeneous symmetric rational functions. Besides the property that all the coefficients are coming from the base field, there is also a significant one on the degrees of the obtained polynomial; namely, the degree of each term satisfies certain condition. Next, for any cyclic codes the unknown syndrome representation can also be provided by the proposed MVIF and also has the same properties. By applying the unknown syndrome representation and the Berlekamp-Massey algorithm, one-step decoding algorithms can be developed to determine the error locator polynomials for arbitrary cyclic codes.
منابع مشابه
The Book Review Column 1
4. Algebraic Function Fields and Codes by Henning Stichtenoth. Reviewed by Swastik Kopparty. This book gives a rigorous, systematic and thorough treatment of the theory of algebraic function fields and its applications in coding theory. Algebraic function fields are natural objects that arise in the study of algebraic curves and exponential sums over finite fields, and have found widespread app...
متن کاملNew classes of permutation binomials and permutation trinomials over finite fields
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinational design, communication theory and so on. Permutation binomials and trinomials attract people’s interest due to their simple algebraic form and additional extraordinary properties. In t...
متن کاملSolving Polynomial Systems over Finite Fields: Algorithms, Implementation and Applications
Polynomial systems can be used to formulate a large variety of non-linear problems. Polynomial systems over finite fields are of particular interest because of their applications in Cryptography, Coding Theory, and other areas of information science and technologies. Solving polynomial systems is a central topic in Computer Algebra and has stimulated the development in this area. In this thesis...
متن کاملA Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show that it is possible to find an n-variable interpolating polynomial with at most t terms, using the number of field operations that is polynomial in t and n. The algorithm exploits the structure of the multivariate gen...
متن کاملThe Fourier Convolution Theorem over Finite Fields: Extensions of Its Application to Error Control Coding
Linear spectral transform techniques such as the discrete Fourier transform and wavelet analysis over real and complex fields have been routinely applied in the literature (Burrus et al. (1998); Strang & Nuygen (1996)). Furthermore, extensions of these techniques over finite fields (Blahut & Burrus (1991); Caire et al. (1993)) have led to applications in the areas of information theory and erro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1209.1198 شماره
صفحات -
تاریخ انتشار 2012